Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data
نویسندگان
چکیده
منابع مشابه
Recent Developments in the Sparse Fourier Transform
The Discrete Fourier Transform (DFT) is a fundamental component of numerous computational techniques in signal processing and scientific computing. The most popular means of computing the DFT is the Fast Fourier Transform (FFT). However, with the emergence of big data problems, in which the size of the processed data sets can easily exceed terabytes, the “Fast” in Fast Fourier Transform is ofte...
متن کاملSparse 2D Fast Fourier Transform
This paper extends the concepts of the Sparse Fast Fourier Transform (sFFT) Algorithm introduced in [1] to work with two dimensional (2D) data. The 2D algorithm requires several generalizations to multiple key concepts of the 1D sparse Fourier transform algorithm. Furthermore, several parameters needed in the algorithm are optimized for the reconstruction of sparse image spectra. This paper add...
متن کاملA Sublinear Algorithm of Sparse Fourier Transform for Nonequispaced Data
Nonequispaced Data Jing Zou 12th August 2005 Abstract We present a sublinear randomized algorithm to compute a sparse Fourier transform for nonequispaced data. More precisely, we address the situation where a signal is known to consist of equispaced samples, of which only are available. This includes the case of “equispaced data with gaps”; if the ratio is smaller than 1, the available data are...
متن کاملThe sparse fourier transform : theory & practice
The Fourier transform is one of the most fundamental tools for computing the frequency representation of signals. It plays a central role in signal processing, communications, audio and video compression, medical imaging, genomics, astronomy, as well as many other areas. Because of its widespread use, fast algorithms for computing the Fourier transform can benefit a large number of applications...
متن کاملSparse Eigenvectors of the Discrete Fourier Transform
We construct a basis of sparse eigenvectors for the N-dimensional discrete Fourier transform. The sparsity differs from the optimal by at most a factor of four. When N is a perfect square, the basis is orthogonal.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Magazine
سال: 2014
ISSN: 1053-5888
DOI: 10.1109/msp.2014.2329131